Relating Tabular Parsing Algorithms for Lig and Tag
نویسندگان
چکیده
Tree Adjoining Grammars (TAG) and Linear Indexed Grammars (LIG) are extensions of Context Free Grammars that generate the class of Tree Adjoining Languages. Taking advantage of this property, and providing a method for translating a TAG into a LIG, we define several parsing algorithms for TAG on the basis of their equivalent LIG parsers. We also explore why some practical optimizations for TAG parsing cannot be applied to the case of LIG.
منابع مشابه
Tabular Algorithms for TAG Parsing
We describe several tabular algorithms for Tree Adjoining Grammar parsing, creating a continuum from simple pure bottom-up algorithms to complex predictive algorithms and showing what transformations must be applied to each one in order to obtain the next one in the continuum.
متن کاملAn Optimal Tabular Parsing Algorithm
In this paper we relate a number of parsing algorithms which have been developed in very diierent areas of parsing theory, and which include deterministic algorithms , tabular algorithms, and a parallel algorithm. We show that these algorithms are based on the same underlying ideas. By relating existing ideas, we hope to provide an opportunity to improve some algorithms based on features of oth...
متن کاملTabular parsing and algebraic transformations
We present an algebraic description of tabular parsing algorithms that avoids a significant problem of Sikkel’s description, namely that inconsistent parse items cannot be represented. We show that a parse item must be regarded as a pair consisting of a congruence class of partial parse trees and a tuple of strings. A tabular parsing algorithm is described algebraically by a pair of algebras wi...
متن کاملThe Use of Shared Forests in Tree Adjoining Grammar Parsing
We study parsing of tree adjoining grammars with particular emphasis on the use of shared forests to represent all the parse trees deriving a well-formed string. We show that there are two distinct ways of representing the parse forest one of which involves the use of linear indexed grammars and the other the use of context-free grammars. The work presented in this paper is intended to give a g...
متن کاملA tabular interpretation of bottom-up automata for TAG
We present a tabular interpretation for a class of 2–Stack Automata that may be used to describe bottom-up parsing strategies for TAGs. The results are also useful for tabulating other existing bottomup automata models for this kind of languages.
متن کامل